Generating Plans To Succeed in Uncertain Environments

نویسندگان

  • Sugato Bagchi
  • Gautam Biswas
  • Kazuhiko Kawamura
چکیده

tic knowledge to aid decision-making has been studied Planners have traditionally not handled domain uncertainty, postponing that poesib’xlity to error monitoring routines during the execution of the plan. In real-world domains with incomplete knowledge, this results in inevitable delays d’-e to rep]annlug. This paper describes a planner that considers the rellabflity of the agent’s actions (leaxned from previous experience) while generating a plan. This is done by incorporating into the domain representation, the probabilities that the effects of an action will be observed after its execution. These probabilities may depend on the current state of the environment, allowing the formation of hard and soft constraints for actions. Action selection is performed by computing an ~expected utility = for each action by a bidirectional spreading activation process which propagates goal utilities backwaxd and predicted states of the environment forwexd. This connectionist approach allows the simultaneous generation of multiple plans, resulting in the availability of fall-back pIans if the one with the highest probability of succeeding fails.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Factored Symbolic Approach to Reactive Planning∗

Autonomous systems in uncertain dynamic environments must reconfigure themselves in response to unanticipated events and goals in real-time. To provide a high assurance of real-time embedded systems, fault-aware executable specification and verification of this fault-aware specification are necessary. We present a method for synthesizing an executable code from a fault-aware specification. We a...

متن کامل

A Decomposed Symbolic Approach to Reactive Planning

Autonomous systems in uncertain dynamic environments must reconfigure themselves in response to unanticipated events and goals in real-time. We present an approach to reactive configuration planning based on the principle of decomposition. Reactive plans are susceptible to exponential state space explosion. We address this problem through transition-based decomposition by generating compact dec...

متن کامل

Rapid Generation of Motion Plans for Modular Robotic Systems

Robots are needed to perform important tasks in field environments. A limitation to the practical use of robot systems is their high cost and long development times. It would be desirable to rapidly design and fabricate the hardware and software for these systems, on a time scale of days or weeks instead of years. An integral part of this system is a rapid generator of the motion plans that the...

متن کامل

Plan Execution in Dynamic Environments

This paper deals with plan execution on agents/robots in highly dynamic environments. Besides a formal semantics of plan execution and a representation of plans as programs, we introduce the concept of plan invariants. Plan invariants are similar to loop invariants in imperative programs in that they have to be true during the whole plan execution cycle. Once a plan invariant fails the plan exe...

متن کامل

Symbol Acquisition for Probabilistic High-Level Planning

We introduce a framework that enables an agent to autonomously learn its own symbolic representation of a low-level, continuous environment. Propositional symbols are formalized as names for probability distributions, providing a natural means of dealing with uncertain representations and probabilistic plans. We determine the symbols that are sufficient for computing the probability with which ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994